Verified Decision Procedures on Context-Free Grammars
نویسنده
چکیده
We verify three decision procedures on context-free grammars utilized in a program analyzer for a server-side programming language. One of the procedures decides inclusion between a context-free language and a regular language. The other two decide decision problems related to the well-formedness and validity of XML documents. From its formalization, we generate executable code for a balancedness checking procedure and incorporate it into an existing program analyzer.
منابع مشابه
Prefix Probabilities for Linear Context-Free Rewriting Systems
We present a novel method for the computation of prefix probabilities for linear context-free rewriting systems. Our approach streamlines previous procedures to compute prefix probabilities for context-free grammars, synchronous context-free grammars and tree adjoining grammars. In addition, the methodology is general enough to be used for a wider range of problems involving, for example, sever...
متن کاملModellingandanalyzing Systems with Recursive Petri Nets
Recursive Petri nets (RPNs) have been introduced to model systems with dynamic structure. In a previous work, we have shown that this model is a strict extension of Petri nets, whereas reachability in RPNs remains decidable. Here, we focus on its modelling features and on some additional theoretical aspects. Three diierent kinds of discrete event systems are modellized by RPNs in order to give ...
متن کاملModel Checking and Higher - Order
Since Muller and Schupp have shown that monadic second-order logic is decidable for context-free graphs in MS85], several specialized procedures have been developed for related problems, mostly for sublogics like the modal-calculus, or even its alternation-free fragment. This work shows the decidability of s1s, the trace version of msol, for the richer set of macro graphs. The generation mechan...
متن کاملStudying impressive parameters on the performance of Persian probabilistic context free grammar parser
In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...
متن کاملHyperedge Replacement, Graph Grammars
In this survey the concept of hyperedge replacement is presented as an elementary approach to graph and hypergraph generation. In particular, hyperedge replacement graph grammars are discussed as a (hyper)graph-grammatical counterpart to context-free string grammars. To cover a large part of the theory of hyperedge replacement, structural properties and decision problems, including the membersh...
متن کامل